منابع مشابه
On a list-coloring problem
We study the function f G de ned for a graph G as the smallest integer k such that the join ofG with a stable set of size k is not jV G j choosable This function was introduced recently in order to describe extremal graphs for a list coloring version of a famous inequality due to Nordhaus and Gaddum Some bounds and some exact values for f G are determined
متن کاملA new Simulated Annealing algorithm for the robust coloring problem
The Robust Coloring Problem (RCP) is a generalization of the well-known Graph Coloring Problem where we seek for a solution that remains valid when extra edges are added. The RCP is used in scheduling of events with possible last-minute changes and study frequency assignments of the electromagnetic spectrum. This problem has been proved as NP-hard and in instances larger than 30 vertices, meta-...
متن کاملNew bounds on a hypercube coloring problem
In studying the scalability of optical networks, one problem which arises involves coloring the vertices of the n-cube with as few colors as possible such that any two vertices whose Hamming distance is at most k are colored differently. Determining the exact value of χk̄(n), the minimum number of colors needed, appears to be a difficult problem. In this note, we improve the known lower and uppe...
متن کاملA Coloring Problem
Introduction. A well-known algorithm for coloring the vertices of a graph is the “greedy algorithm”: given a totally ordered set of colors, each vertex of the graph (taken in some order) is colored with the least color not already used to color an adjacent vertex. When applied to a path graph with at least two vertices, the algorithm uses either 2 or 3 colors, depending on the order in which th...
متن کاملOn the General Coloring Problem
Generalizing relational structures and formal languages to structures whose relations are evaluated by elements of a lattice, we show that such structure classes form a Heyting algebra if and only if the evaluation lattice is a Heyting algebra. Hence various new and some older results obtained for Heyting algebras can be applied to such structure classes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATHEMATICA SCANDINAVICA
سال: 1960
ISSN: 1903-1807,0025-5521
DOI: 10.7146/math.scand.a-10607